Quality:

Edge disjoint shortest pair algorithm - algorithm in computer network routing. Article “Edge disjoint shortest pair algorithm” in English Wikipedia has 22.4 points for quality (as of July 1, 2025).
The article contains 10 references and 4 sections. The article also contains templates indicating quality issues, therefore its score was reduced by 1.18 points.
Since the creation of article “Edge disjoint shortest pair algorithm”, its content was written by 18 registered users of English Wikipedia and edited by 18 registered Wikipedia users in all languages.
The article is cited 4 times in English Wikipedia and cited 4 times in all languages.
The highest Authors Interest rank from 2001:
- Local (English): #167955 in October 2005
- Global: #297961 in October 2005
The highest popularity rank from 2008:
- Local (English): #879603 in January 2008
- Global: #1413816 in January 2008
There is 1 language version for this article in the WikiRank database (of the considered 55 Wikipedia language editions).
The quality and popularity assessment was based on Wikipédia dumps from July 1, 2025 (including revision history and pageviews for previous years).